#include"RBTree.h"

void RBTreetest1()
{
	RBTree<int, int> t;
	//int a[] = { 16,3,7,11,9,26,18,14,15 };
	int a[] = { 4,2,6,1,3,5,15,7,16,14 };
	for (auto e : a)
	{
		t.Insert({ e,e });
		//cout << e << "->" << t.IsBalance() << endl;
	}
	//t.InOrder();
	cout << t.IsBalance() << endl;

}

int main()
{
	RBTreetest1();
	return 0;
}
